Lower bounds for representation growth

Lower Bounds for Representation Growth

This article examines lower bounds for the representation growth of finitely generated (particularly profinite and pro-p) groups. It also considers the related question of understanding the maximal multiplicities of character degrees in finite groups, and in particular simple groups.

Some Lower Bounds for Estrada Index

Variational representation , HCR and CR lower bounds

It should be noted that the requirement of f to be convex in the definition of f -divergence is essential. In Euclidean spaces any convex function can be represented as the pointwise supremum of a family of affine functions and vice versa, every supremum of a family of affine functions produces a convex function. Take f(x) = 12 |x− 1| as an example. We see that it can be written as a pointwise ...

Upper and lower bounds for numerical radii of block shifts

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...